Generating bicliques of a graph in lexicographic order

A New Method for Generating Permutations in Lexicographic Order

First, an ordinal representation scheme for permutations is defined. Next, an “unranking” algorithm that can generate a permutation of n items according to its ordinal representation is designed. By using this algorithm, all permutations can be systematically generated in lexicographic order. Finally, a “ranking” algorithm that can convert a permutation to its ordinal representation is designed...

A Simple Systolic Algorithm for Generating Combinations in Lexicographic Order

A systolic algorithm is described for generating, in lexicographlcally ascending order, all combinations of m objects chosen from {1 .... ,n). The algorithm is designed to he executed on a linear array of m processors, each having constant size memory, and each being responsible for producing one dement of a given combination. There is a constant delay per combination, leading to an O(C(m, n)) ...

An Optimal Systolic Algorithm for Generating Permutations in Lexicographic Order

Incremental Maintenance of Maximal Bicliques in a Dynamic Bipartite Graph

We consider incremental maintenance of maximal bicliques from a dynamic bipartite graph that changes over time due to the addition of edges. When new edges are added to the graph, we seek to enumerate the change in the set of maximal bicliques, without enumerating the set of maximal bicliques that remain unaffected. The challenge in an efficient algorithm is to enumerate the change without expl...

An High-Order Graph Generating Neural Network

A large class of neural network models have their units organized in a lattice with fixed topology or generate their topology during the learning process (usually unsupervised). These network models can be used as neighborhood preserving map and some of them generate a perfect topology preserving map of the input manifold using competitive Hebbian rule. But such a structure is difficult to mana...